|
The structural cut-off is a concept in network science which imposes a degree cut-off in the degree distribution of a finite size network due to structural limitations (such as the simple graph property). Networks with vertices with degree higher than the structural cut-off will display structural disassortativity. ==Definition== The structural cut-off is a maximum degree cut-off that arises from the structure of a finite size network. Let be the number of edges between all vertices of degree and if , and twice the number if . Given that multiple edges between two vertices are not allowed, is bounded by the maximum number of edges between two degree classes . Then, the ratio can be written : is the probability that a randomly picked edge will connect on one side a vertex with degree with a vertex of degree . To be in the physical region, must be satisfied. The structural cut-off is then defined by . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Structural cut-off」の詳細全文を読む スポンサード リンク
|